package com.maltys.dp.sequence;

/**
 * @author malty
 * @link <a href="https://leetcode.cn/problems/maximum-length-of-repeated-subarray/description/">最⻓重复⼦数组</a>
 */
public class MaxLenOfRepeatedSubarray {
    public static void main(String[] args) {
        MaxLenOfRepeatedSubarray subarray = new MaxLenOfRepeatedSubarray();
        int length = subarray.findLength(new int[]{1, 2, 3, 2, 1}, new int[]{3, 2, 1, 4, 7});
        System.out.println(length);
    }

    public int findLength(int[] nums1, int[] nums2) {
        int[][] dp = new int[nums1.length + 1][nums2.length + 1];
        int maxLength = 0;
        for (int i = 1; i <= nums1.length; i++) {
            for (int j = 1; j <= nums2.length; j++) {
                if (nums1[i - 1] == nums2[j - 1]) {
                    dp[i][j] = dp[i - 1][j - 1] + 1;
                }
                maxLength = Math.max(maxLength, dp[i][j]);
            }
        }
        return maxLength;
    }
}
